Quine on Modal Logic Justin Bledin March 13, 2011 1

Source URL: johnmacfarlane.net

• Philosophy of language
• Opaque context
• Predicate logic
• Philosophical logic
• Function
• Free variables and bound variables
• Modal logic
• Referential transparency
• Logic
• Mathematics
• Analytic philosophy

Regularity Problems for Weak Pushdown ω-Automata and Games Extended VersionChristof L¨oding and Stefan Repke⋆ Lehrstuhl f¨ ur Informatik 7, RWTH Aachen, Germany

Source URL: www.automata.rwth-aachen.de

• Formal languages
• Computer science
• Deterministic pushdown automaton
• Ω-automaton
• Pushdown automaton
• Omega language
• Nondeterministic finite automaton
• Context-free language
• Regular language
• Automata theory
• Theoretical computer science
• Models of computation

Context-Free Languages and Pushdown Automata Jean-Michel Autebert1 , Jean Berstel2 , and Luc Boasson3 1 2 3

Source URL: www-igm.univ-mlv.fr

• Context-free language
• Linear grammar
• Context-free grammar
• Formal grammar
• Vector space
• Nested word
• Pushdown automaton
• Formal languages
• Algebra
• Mathematics

Algorithms Lecture 5: Context-Free Languages and Grammars [Fa’14] Caveat lector: This is the first edition of this lecture note. Please send bug reports and suggestions to .

Source URL: web.engr.illinois.edu

• Mathematics
• Context-free grammar
• Formal grammar
• Terminal and nonterminal symbols
• Ambiguous grammar
• Regular language
• Context-sensitive grammar
• Controlled grammar
• Formal languages
• Combinatorics
• Grammar

Unsupervised word segmentation for Sesotho using Adaptor Grammars Mark Johnson Brown University Mark

Source URL: www.aclweb.org

• Computational linguistics
• Grammar
• Speech recognition
• Compiler construction
• Natural language processing
• Parsing
• Morpheme
• Stochastic context-free grammar
• Context-free grammar
• Linguistics
• Science
• Formal languages

Natural Language Generation with Tree Conditional Random Fields

Source URL: www.comp.nus.edu.sg

• Natural language processing
• Speech recognition
• Formal languages
• Compiler construction
• N-gram
• Conditional random field
• Context-free grammar
• Formal grammar
• Parsing
• Computational linguistics
• Linguistics
• Science

ICS 162 – Fall 2003 – Midterm Name: Student ID: 1:

Source URL: www.ics.uci.edu

• Models of computation
• Computer science
• Software engineering
• Regular language
• Deterministic finite automaton
• Context-free grammar
• Nondeterministic finite automaton
• Regular expression
• Book:Theory Of Computation
• Automata theory
• Formal languages
• Theoretical computer science

A Classifier-Based Parser with Linear Run-Time Complexity Kenji Sagae and Alon Lavie Language Technologies Institute Carnegie Mellon University Pittsburgh, PA 15213

Source URL: people.ict.usc.edu

• Parser generators
• Compiler construction
• Formal languages
• Parsing
• Bottom-up parsing
• SYNTAX
• Parse tree
• GOLD
• Stochastic context-free grammar
• Programming language implementation
• Software engineering
• Computing

Automatic construction of parse trees for lexemes ∗ Danny Dub´e Anass Kadiri Universit´e Laval

Source URL: repository.readscheme.org

• Formal languages
• Computing
• Automata theory
• Models of computation
• Parsing
• Lexical analysis
• Context-free grammar
• Parse tree
• Regular expression
• Programming language implementation
• Software engineering
• Compiler construction

Free online dictionaries with context sentences, synonyms, and pronunciation Language games and quizzes Vocabulary lessons and conjugation tables Phrasebooks for work, university, travel, and living abroad

Source URL: en.bab.la